An Adaptive Multialphabet Arithmetic Coding Based on Generalized Virtual Sliding Window
نویسندگان
چکیده
منابع مشابه
Multialphabet Arithmetic Coding at 16 MBytes/sec
We present the design and performance of a non-adaptive hardware system for data compression by arithmetic coding. The alphabet of the data source is the full 256-symbol ASCII character set, plus a non-ASCII end-ofle symbol. The key ideas of our system are the non-arithmetic representation of the current interval width, which yields improved coding e ciency in the interval-width update, and a r...
متن کاملSliding window based CAC for adaptive service in mobile network
The CAC algorithm of mobile network is responsible for reducing the handoff drop ratio(HDR) to an acceptable low level as well as achieving a high accept ratio for locally generated calls. Algorithms based on dynamic resource reservation depend on complex measurement, calculation and information exchange between cells. Recently, adaptive service has been proposed to protect the QoS of mobile us...
متن کاملAn Enhanced Lossless Color Filter Array Image Compression Based on Predictive Adaptive Arithmetic Coding
Received Dec 11, 2014 Revised Feb 10, 2015 Accepted Feb 19, 2015 Most consumer digital cameras use a single image light sensor which provides color information using color filter array(CFA).This provided a mosaic images, in which each pixel position contains only one color component in case of Bayer CFA Pattern. This paper produced a CFA hierarchical prediction scheme based on context adaptive ...
متن کاملGeneralized Kraft Inequality and Arithmetic Coding
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that Zi2"i 5 2". This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within E . The coding speed is comparable to that of conventional coding metho...
متن کاملAn Efficient Sliding Window Based Algorithm for Adaptive Frequent Itemset Mining over Data Streams
Mining frequent itemsets over high speed, continuous and infinite data streams is a challenging problem due to changing nature of data and limited memory and processing capacities of computing systems. Sliding window is an interesting model to solve this problem since it does not need the entire history of received transactions and can handle concept change by considering only a limited range o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2017
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2017.2705250